A hybrid domain decomposition method based on one-level FETI and BDDC algorithms

نویسنده

  • Jungho Lee
چکیده

A three-level domain decomposition is considered. Bodies in contact with each other are divided into subdomains, which in turn are the union of elements. Using an approach based purely on FETI (finite element tearing and interconnecting) algorithms with only Lagrange multipliers as unknowns, which has been developed by the engineering community, does not lead to a scalable algorithm with respect to the number of subdomains in each body. Instead, we consider a new method based on the saddle point formulation of the FETI methods with both displacement vectors and Lagrange multipliers as unknowns. The resulting system is solved with a block-diagonal preconditioner which combines the one-level FETI and the BDDC (balancing domain decomposition by constraints) methods. We show that this new method is scalable with respect to the number of subdomains. A model contact problem is solved by a nonlinear algorithm which combines the new method and a primal-dual active set method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

FETI–DP, BDDC, and Block Cholesky Methods

Two popular non-overlapping domain decomposition methods, the FETI–DP and BDDC algorithms, are reformulated using Block Cholesky factorizations, an approach which can provide a useful framework for the design of domain decomposition algorithms for solving symmetric positive definite linear system of equations. Instead of introducing Lagrange multipliers to enforce the coarse level, primal conti...

متن کامل

BDDC Algorithms for Incompressible Stokes Equations

The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle-point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are iterative substructuring methods, which form a class of domain decomposition methods based on the decomposition of the domain ...

متن کامل

A BDDC Preconditioner for Saddle Point Problems

The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are defined in terms of a set of primal continuity constraints, which are enforced across the interface between the subdomains, an...

متن کامل

A 738

New nonlinear FETI-DP (dual-primal finite element tearing and interconnecting) and BDDC (balancing domain decomposition by constraints) domain decomposition methods are introduced. In all these methods, in each iteration, local nonlinear problems are solved on the subdomains. The new approaches can significantly reduce communication and show a significantly improved performance, especially for ...

متن کامل

Nonlinear FETI-DP and BDDC Methods

New nonlinear FETI-DP (dual-primal finite element tearing and interconnecting) and BDDC (balancing domain decomposition by constraints) domain decomposition methods are introduced. In all these methods, in each iteration, local nonlinear problems are solved on the subdomains. The new approaches can significantly reduce communication and show a significantly improved performance, especially for ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010